Annotated defeasible logic

نویسندگان

  • Guido Governatori
  • Michael J. Maher
چکیده

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. This limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in some legal settings, different actors have different burdens of proof, which might be expressed as reasoning in different defeasible logics. In this paper, we introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism. This paper is under consideration for acceptance in Theory and Practice of Logic Programming.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paraconsistent Annotated Logic Program EVALPSN and Its Application to Intelligent Control

We have developed an annotated logic program called an Extended Vector Annotated Logic Program with Strong Negation(abbr. EVALPSN), which can deal with defeasible deontic reasoning and contradiction. We also have extended EVALPSN to deal with before-after relation between processes, which was named beforeafter(abbr. bf)EVALPSN. We have already applied EVALPSN and bf-EVALPSN to various kinds of ...

متن کامل

Defeasible Reasoning Between Conflicting Agents

We propose a method to model agents’ schedules aiming to resolve conflicts between agents based on the defeasible reasoning by VALPSN(Vector Annotated Logic Program with Strong Negation). In the method, first, agents’ schedules are defined by Billington’s defensible theories. The defensible theories are translated into VALPSNs as the next step and the VALPSNs’ stable models are computed aa the ...

متن کامل

A Theory of Nonmonotonic Inheritance Based on Annotated Logic

We propose a logical language for representing networks with nonmonotonic multiple inheritance. The language is based on a variant of annotated logic studied in 5, 6, 17, 18, 19, 20, 21]. The use of annotated logic provides a rich setting that allows to disambiguate networks whose topology does not provide enough information to decide how properties are to be inherited. The proposed formalism h...

متن کامل

Theory of multiple-valued defeasible argumentation and its applications

This paper provides a new departure from the traditional twovalued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a Logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated Logic Programming (EALP), and examine its logical properties in various ways. EALP all...

متن کامل

Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach

There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge but knowledge itself, where apart from nondefeasible knowledge the prototypical knowledge can be distinguished. In the current paper we rely on the cognitive Dual Theory comprising the classical theory of definition wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • TPLP

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2017